Ising models on locally tree-like graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ising models on locally tree-like graphs

We consider Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the ‘cavity’ prediction for the limiting free energy per spin is correct for any temperature and external field. Further, local marginals can be approximated by iterating a set of mean field (cavity) ...

متن کامل

Factor models on locally tree-like graphs

We consider homogeneous factor models on uniformly sparse graph sequences converging locally to a (unimodular) random tree T , and study the existence of the free energy density φ, the limit of the log-partition function divided by the number of vertices n as n tends to infinity. We provide a new interpolation scheme and use it to prove existence of, and to explicitly compute, the quantity φ su...

متن کامل

The weak limit of Ising models on locally tree-like graphs

We consider the Ising model with inverse temperature β and without external field on sequences of graphs Gn which converge locally to the k-regular tree. We show that for such graphs the Ising measure locally weak converges to the symmetric mixture of the Ising model with + boundary conditions and the − boundary conditions on the k-regular tree with inverse temperature β. In the case where the ...

متن کامل

Ferromagnetic Ising Measures on Large Locally Tree-like Graphs by Anirban Basak

We consider the ferromagnetic Ising model on a sequence of graphs Gn converging locally weakly to a rooted random tree. Generalizing [Probab. Theory Related Fields 152 (2012) 31–51], under an appropriate “continuity” property, we show that the Ising measures on these graphs converge locally weakly to a measure, which is obtained by first picking a random tree, and then the symmetric mixture of ...

متن کامل

Latent Voter Model on Locally Tree-Like Random Graphs

In the latent voter model, which models the spread of a technology through a social network, individuals who have just changed their choice have a latent period, which is exponential with rate λ, during which they will not buy a new device. We study site and edge versions of this model on random graphs generated by a configuration model in which the degrees d(x) have 3 ≤ d(x) ≤M . We show that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 2010

ISSN: 1050-5164

DOI: 10.1214/09-aap627